邻域并与泛圈图

本文中 ,我们用邻域并对泛圈图进行深入的研究 ,主要取得了“2连通 n( n≥ 3 )阶图 G,满足下列条件之一 ,则 G是泛圈图 : :δ≤ ( n-7) /3 ,N C≥ ( 2 n-3 ) /3 ; :( n-6) /3≤ δ≤ ( n+2 ) /3 ,N C≥ 2 n/3 ; :δ≥ ( n+3 ) /3 ,N C≥ ( 2 n-3 ) /3 .当 3≤ n≤ 14时 ,N C≥ 2 n/3”     

有限群表示的一个结论

利用陪集、重陪集等概念和性质 ,证明了一个利用有限群 G的子集表示 G的结论 .     

Relative versions of some star-selection principles

We introduce some relative versions of star selection principles first considered in [5], [11]. Some of the work extends results from [4], [5] and gives some examples.      

The spum and sum-diameter of graphs: Labelings of sum graphs

A sum graph is a finite simple graph whose vertex set is labeled with distinct positive integers such that two vertices are adjacent if and only if the sum of their labels is itself another label. The spum of a graph G is the minimum difference between the largest and smallest labels in a sum graph consisting of G and the minimum number of additional isolated vertices necessary so that a sum graph labeling exists. We investigate the spum of various families of graphs, namely cycles, paths, and matchings. We introduce the sum-diameter, a modification of the definition of spum that omits the requirement that the number of additional isolated vertices in the sum graph is minimal, which we believe is a more natural quantity to study. We then provide asymptotically tight general bounds on both sides for the sum-diameter, and study its behavior under numerous binary graph operations as well as vertex and edge operations. Finally, we generalize the sum-diameter to hypergraphs.     

一种自适应人工蜂群算法求解U型顺序相依拆卸线平衡问题

产品拆卸过程中零部件之间会相互干扰影响任务作业时间,基于该情形构建了多目标U型SDDLBP优化模型,并提出一种自适应ABC算法。所提算法设计了自适应动态邻域搜索方法,以提高局部开发能力;采用了轮盘赌与锦标赛法结合的分段选择法,以有效评价并选择蜜源进行深度开发;建立了基于当前最优解的变异操作,以提高全局探索能力快速跳出局部最优。最后,通过算例测试和实例分析验证算法的高效性。     

On the Hartogs-Bochner phenomenon for CR functions in

Let be a compact, connected, -smooth and globally minimal hypersurface in which divides the projective space into two connected parts and . We prove that there exists a side, or , such that every continuous CR function on extends holomorphically to this side. Our proof of this theorem is a simplification of a result originally due to F. Sarkis.

     

Fuzzy nilpotent algebras

We define the concept of fuzzy nilpotent algebra, prove that the homomorphic inverse image of a fuzzy nilpotent algebra is also nilpotent and study the intersection and union of fuzzy nilpotent algebras.     

The rollon–rolloff waste collection vehicle routing problem with time windows

This study introduces a rollon–rolloff waste collection vehicle routing problem involving large containers that accumulate huge amounts of garbage at construction sites and shopping districts. In this problem, tractors move one container at a time between customer locations, a depot, disposal facilities, and container storage yards. The complicated constraints discussed in this study arise from having multiple disposal facilities, multiple container storage yards, seven service types of customer demands, different time windows for customer demands and facilities, various types and sizes of containers, and the lunch break of tractor drivers. In addition, real-world issues, such as changing service types, multiple demands at a customer’s location, and tractors with different work schedules, are dealt with. This study proposes a large neighborhood search based iterative heuristic approach consisting of several algorithms for the problem. The effectiveness of the proposed methods is demonstrated by computational experiments using benchmark data, some instances of which are derived from real-world problems.